Best-choice Problems with Dependent Criteria
نویسنده
چکیده
The multiple criteria secretary problem in which the criteria are independent and the objective is to choose an applicant that is best in at least one criterion was solved by Gnedin (1981). We generalize this result to the case of two criteria that may be dependent. Two models, one assuming independence of the vectors of ranks and the other assuming independence of the variables on which the rankings are based, although equivalent in the case of independent criteria, are seen to be quite distinct for dependent criteria. §
منابع مشابه
Optimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem
In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...
متن کاملAnalysis of the Utility of Economic Sectors in Achieving Agricultural Development: Applying an Analytic Hierarchy Process
ABSTRACT- According to article 44 of the I.R. of Iran Constitution, the Iranian economy consists of three sectors; the state, the cooperative, and the private sectors. The aim of this study was to present a hierarchy of criteria for selecting the best economic sector for agricultural development. Analytic Hierarchy Process (AHP) was used to calculate the relative importance of either criteria o...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کاملPrioritization of Purchasing Criteria by Linear Best-Worst Multi-Criteria Decision-Making Method for Optimal Provision of Medical Supplies
Introduction: One of the main challenges of the health system is improving the quality of healthcare services by adjusting the costs. The right choice of tools will bring economic savings besides excellent service quality. Since medical supplies are among the fundamental and costly elements in providing services, the expertise of purchasing has become an important and complex issue. This study ...
متن کامل